Comparing multiagent systems research in combinatorial auctions and voting
نویسندگان
چکیده
منابع مشابه
Research Problems in Combinatorial Auctions
Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles o...
متن کاملPrice-Setting Combinatorial Auctions for Coordination and Control of Manufacturing Multiagent Systems: Updating Prices Methods
Combinatorial auctions are used as a distributed coordination mechanism in Multiagent Systems. The use of combinatorial auctions as negotiation and coordination mechanism is especially appropriate in systems with interdependencies and complementarities such as manufacturing scheduling systems. In this work we review some updating price mechanisms for combinatorial auctions based on the Lagrangi...
متن کاملPrice Updating in Combinatorial Auctions for Coordination of Manufacturing Multiagent Systems
In this work we use the paradigm of multiagent systems to solve the Job Shop problem. Job Shop problem is a particular problem of scheduling in which we try to find an schedule that optimize a objective and is subject to certain constraints. We propose a combinatorial auction mechanism to coordinate agents. The “items” to be sold are the time slots that we divide the time horizon into. In tasks...
متن کاملCPSC 532a: Multiagent Systems Can agents be collaborative? Combinatorial Auctions for Collaborative Planning
When multiple rational utility-maximizing agents make some interactions, there are opportunities for them to collaborate on a group activity. In such occasions, they should be able to decide whether to commit themselves to that activity in a way that they can maximize their own utility. This problem is referred as the initial commitment decision problem (ICDP). In this paper, we present a brief...
متن کاملComparing winner determination algorithms for mixed multi-unit combinatorial auctions
In this thesis three different approaches to the Winner Determination Problem (WDP) for Mixed Multi-Unit Combinatorial Auctions (MMUCA) are explored. The first, due to [Cerquides et al., 2007] is based on a traditional integer programming approach. The second, due to [Uckelman and Endriss, 2007] is based on constraint programing and the third is based on a division of the original problem in tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2010
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-010-9205-y